On $H$-antimagicness of Cartesian product of graphs
نویسندگان
چکیده
منابع مشابه
On H -antimagicness of Cartesian product of graphs
A graph G = (V (G), E(G)) admits an H -covering if every edge in E belongs to a subgraph of G isomorphic to H . A graph G admitting an H -covering is called (a, d) -H -antimagic if there is a bijection f : V (G) ∪ E(G) → {1, 2, . . . , |V (G)| + |E(G)|} such that, for all subgraphs H ′ of G isomorphic to H , the H -weights, wtf (H ′) = ∑ v∈V (H′) f(v)+ ∑ e∈E(H′) f(e), constitute an arithmetic p...
متن کاملThe antimagicness of the Cartesian product of graphs
An antimagic labeling of a graph with M edges and N vertices is a bijection from the set of edges to the set {1, 2, 3, . . . ,M} such that all the N vertex-sums are pairwise distinct, where the vertex-sum of a vertex v is the sum of labels of all edges incident with v. A graph is called antimagic if it has an antimagic labeling. The antimagicness of the Cartesian product of graphs in several sp...
متن کاملSecret Sharing Based On Cartesian product Of Graphs
The purpose of this paper is to study the information ratio of perfect secret sharing of product of some special families of graphs. We seek to prove that the information ratio of prism graphs $Y_{n}$ are equal to $frac{7}{4}$ for any $ngeq 5$, and we will gave a partial answer to a question of Csirmaz cite{CL}. We will also study the information ratio of two other families $C_{m}times C_{n}$ a...
متن کاملThe reliability Wiener number of cartesian product graphs
Reliability Wiener number is a modification of the original Wiener number in which probabilities are assigned to edges yielding a natural model in which there are some (or all) bonds in the molecule that are not static. Various probabilities naturally allow modelling different types of chemical bonds because chemical bonds are of different types and it is well-known that under certain condition...
متن کاملOn subgraphs of Cartesian product graphs
Graphs which can be represented as nontrivial subgraphs of Cartesian product graphs are characterized. As a corollary it is shown that any bipartite, K2,3-free graph of radius 2 has such a representation. An infinite family of graphs which have no such representation and contain no proper representable subgraph is also constructed. Only a finite number of such graphs have been previously known.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TURKISH JOURNAL OF MATHEMATICS
سال: 2018
ISSN: 1300-0098,1303-6149
DOI: 10.3906/mat-1704-86